全文获取类型
收费全文 | 4646篇 |
免费 | 265篇 |
国内免费 | 59篇 |
专业分类
电工技术 | 13篇 |
综合类 | 143篇 |
化学工业 | 650篇 |
金属工艺 | 87篇 |
机械仪表 | 158篇 |
建筑科学 | 271篇 |
矿业工程 | 34篇 |
能源动力 | 321篇 |
轻工业 | 39篇 |
水利工程 | 44篇 |
石油天然气 | 13篇 |
武器工业 | 12篇 |
无线电 | 133篇 |
一般工业技术 | 437篇 |
冶金工业 | 88篇 |
原子能技术 | 51篇 |
自动化技术 | 2476篇 |
出版年
2024年 | 8篇 |
2023年 | 47篇 |
2022年 | 68篇 |
2021年 | 72篇 |
2020年 | 120篇 |
2019年 | 111篇 |
2018年 | 104篇 |
2017年 | 146篇 |
2016年 | 185篇 |
2015年 | 226篇 |
2014年 | 311篇 |
2013年 | 263篇 |
2012年 | 199篇 |
2011年 | 400篇 |
2010年 | 281篇 |
2009年 | 358篇 |
2008年 | 327篇 |
2007年 | 278篇 |
2006年 | 237篇 |
2005年 | 184篇 |
2004年 | 143篇 |
2003年 | 167篇 |
2002年 | 103篇 |
2001年 | 36篇 |
2000年 | 36篇 |
1999年 | 59篇 |
1998年 | 70篇 |
1997年 | 47篇 |
1996年 | 39篇 |
1995年 | 34篇 |
1994年 | 56篇 |
1993年 | 27篇 |
1992年 | 29篇 |
1991年 | 26篇 |
1990年 | 21篇 |
1989年 | 18篇 |
1988年 | 19篇 |
1987年 | 9篇 |
1986年 | 16篇 |
1985年 | 19篇 |
1984年 | 7篇 |
1983年 | 9篇 |
1982年 | 10篇 |
1981年 | 6篇 |
1980年 | 11篇 |
1979年 | 10篇 |
1978年 | 6篇 |
1977年 | 5篇 |
1976年 | 2篇 |
1975年 | 2篇 |
排序方式: 共有4970条查询结果,搜索用时 187 毫秒
41.
Anastasia Dobroskok Larissa Fradkin Gennady Mishuris 《Engineering Fracture Mechanics》2007,74(11):1719-1726
In the current paper crack redirection due to a strategic placing of a heat source in the vicinity of a crack tip is studied. Analysis suggests that for PMMA and considered temperature range the only factor responsible for the deviation of crack trajectory is thermal stress. The simulation of crack growth in PMMA under external tension and secondary heat loading shows that a moving heat source in the vicinity of a crack tip can serve as a pointer for the crack trajectory. In highly conductive materials, redirection can be possibly effected with low-power thermal dipoles. 相似文献
42.
Christoph Minnameier 《Information Processing Letters》2007,103(3):105-111
Interaction systems are a formal model for component-based systems. Combining components via connectors to form more complex systems may give rise to deadlock situations. We present here a polynomial time reduction from 3-SAT to the question whether an interaction system contains deadlocks. 相似文献
43.
44.
Ilan Gronau 《Information Processing Letters》2007,104(6):205-210
In this work we consider hierarchical clustering algorithms, such as UPGMA, which follow the closest-pair joining scheme. We survey optimal O(n2)-time implementations of such algorithms which use a ‘locally closest’ joining scheme, and specify conditions under which this relaxed joining scheme is equivalent to the original one (i.e. ‘globally closest’). 相似文献
45.
Andrzej Lingas 《Information Processing Letters》2007,104(6):220-227
In 1986, Keil provided an O(n2) time algorithm for the problem of covering monotone orthogonal polygons with the minimum number of r-star-shaped orthogonal polygons. This was later improved to O(n) time and space by Gewali et al. in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63]. In this paper we simplify the latter algorithm—we show that with a little modification, the first step Sweep1 of the discussed algorithm—which computes the top ceilings of horizontal grid segments—can be omitted.In addition, for the minimum orthogonal guard problem in the considered class of polygons, our approach provides a linear time algorithm which uses O(k) additional space, where k is the size of the optimal solution—the algorithm in [L. Gewali, M. Keil, S.C. Ntafos, On covering orthogonal polygons with star-shaped polygons, Information Sciences 65 (1992) 45-63] uses both O(n) time and O(n) additional space. 相似文献
46.
Songhua Xu Haisheng Tan Xiantao Jiao Francis C.M. Lau Yunhe Pan 《Computer Graphics Forum》2007,26(3):609-618
We propose a generic pigment model suitable for digital painting in a wide range of genres including traditional Chinese painting and water-based painting. The model embodies a simulation of the pigment-water solution and its interaction with the brush and the paper at the level of pigment particles; such a level of detail is needed for achieving highly intricate effects by the artist. The simulation covers pigment diffusion and sorption processes at the paper surface, and aspects of pigment particle deposition on the paper. We follow rules and formulations from quantitative studies of adsorption and diffusion processes in surface chemistry and the textile industry. The result is a pigment model that spans a continuum from the very wet to the very dry brush stroke effects. We also propose a new pigment mixing method based on machine learning techniques to emulate pigment mixing in real life as well as to support the creation of new artificial pigments. To experiment with the proposed model, we embedded the model in a sophisticated digital brush system. The combined system exhibits interactive speed on a modest PC platform. http://www.cs.hku.hk/~songhua/pigment provides supplementary materials for this paper. 相似文献
47.
Uwe Schöning 《Information Processing Letters》2006,98(4):127-129
An N-superconcentrator is a directed, acyclic graph with N input nodes and N output nodes such that every subset of the inputs and every subset of the outputs of same cardinality can be connected by node-disjoint paths. It is known that linear-size and bounded-degree superconcentrators exist. Here it is proved that such superconcentrators exist (by a random construction of certain expander graphs as building blocks) having density 28 (where the density is the number of edges divided by N). The best known density before this paper was 34.2 [U. Schöning, Construction of expanders and superconcentrators using Kolmogorov complexity, J. Random Structures Algorithms 17 (2000) 64-77] or 33 [L.A. Bassalygo, Personal communication, 2004]. 相似文献
48.
A polyhedron P is castable if its boundary can be partitioned by a plane into two polyhedral terrains. Castable polyhedra can be manufactured
easily using two cast parts, where each cast part can be removed from the object without breaking the cast part or the object.
If we assume that the cast parts are each removed by a single translation, it is shown that for a simple polyhedron with n vertices, castability can be decided in time and linear space using a simple algorithm. A more complicated algorithm solves the problem in time and space, for any fixed ε > 0. In the case where the cast parts are to be removed in opposite directions, a simple O(n
2
)-time algorithm is presented. Finally, if the object is a convex polyhedron and the cast parts are to be removed in opposite
directions, a simple algorithm is presented.
Received June 1, 1994; revised May 25, 1995. 相似文献
49.
A parallel implementation of the preconditioned GMRES method is described. The method is used to solve the discretized incompressible Navier–Stokes equations. A parallel implementation of the inner product is given, which appears to be scalable on a massively parallel computer. The most difficult part to parallelize is the ILU-preconditioner. We parallelize the preconditioner using ideas proposed by Bastian and Horton (P. Bastian, G. Horton, SIAM. J. Stat. Comput. 12 (1991) 1457–1470). Contrary to some other parallel methods, the required number of iterations is independent of the number of processors used. A model is presented to predict the efficiency of the method. Experiments are done on the Cray T3D, computing the solution of a two-dimensional incompressible flow. Predictions of computing time show good correspondence with measurements. 相似文献
50.
In this paper we study a cell of the subdivision induced by a union ofn half-lines (or rays) in the plane. We present two results. The first one is a novel proof of theO(n) bound on the number of edges of the boundary of such a cell, which is essentially of methodological interest. The second is an algorithm for constructing the boundary of any cell, which runs in optimal (n logn) time. A by-product of our results are the notions of skeleton and of skeletal order, which may be of interest in their own right.This work was partly supported by CEE ESPRIT Project P-940, by the Ecole Normale Supérieure, Paris, and by NSF Grant ECS-84-10902.This work was done in part while this author was visiting the Ecole Normale Supérieure, Paris, France. 相似文献